three metaheuristic algorithms for solving the multi-item capacitated lot-sizing problem with product returns and remanufacturing

نویسندگان

esmaeil mehdizadeh

amir fatehi kivi

چکیده

this paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. the returned products from customers can either be disposed or be remanufactured to be sold as new ones again. due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (sa) algorithm, vibration damping optimization (vdo) algorithm and harmony search (hs) algorithm have been used to solve this model. additionally, taguchi method is conducted to calibrate the parameter of the meta-heuristics and select the optimal levels of the algorithm’s performance influential factors. to verify and validate the efficiency of the proposed algorithms in terms of solution quality, the obtained results were compared with those obtained from lingo 8 software for a different problem. finally, computational results of these algorithms were compared and analyzed by producing and solving some small, medium and large-size test problems. the results confirmed the efficiency of the hs algorithm against the other methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing

This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...

متن کامل

Three Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)

This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...

متن کامل

Metaheuristic optimization for the Single-Item Dynamic Lot Sizing problem with returns and remanufacturing

The use of metaheuristics for solving the Single-Item Dynamic Lot Sizing problem with returns and remanufacturing has increasingly gained research interest. Recently, preliminary experiments with Particle Swarm Optimization revealed that population-based algorithms can be competitive with existing state-of-the-art approaches. In the current work, we thoroughly investigate the performance of a v...

متن کامل

A Vibration Damping Optimization Algorithm for Solving the Single-item Capacitated Lot-sizing Problem with Fuzzy Parameters

In this paper, we propose a vibration damping optimization algorithm to solve a fuzzy mathematical model for the single-item capacitated lot-sizing problem. At first, a fuzzy mathematical model for the single-item capacitated lot-sizing problem is presented. The possibility approach is chosen to convert the fuzzy mathematical model to crisp mathematical model. The obtained crisp model is in the...

متن کامل

Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities

We study the classical capacitated multi-item lot-sizing problem with hard capacities. There are N items, each of which has speci ed sequence of demands over a nite planning horizon of T discrete periods; the demands are known in advance but can vary from period to period. All demands must be satis ed on time. Each order incurs a time-dependent xed ordering cost regardless of the combination of...

متن کامل

Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost

This paper presents two polynomial time algorithms for the constant capacitated lot sizing problem with a batch production. We give several optimality properties for the general problem. Assuming constant production capacity, constant batch size and WagnerWhitin cost structure, we derive O(T ) and O(T ) time algorithms respectively for the case with production capacity multiple of the batch siz...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of optimization in industrial engineering

ناشر: qiau

ISSN 2251-9904

دوره 7

شماره 16 2014

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023